Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision
نویسندگان
چکیده
منابع مشابه
Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision
NURBS surfaces can be non-uniform and defined for any degree, but existing subdivision surfaces are either uniform or of fixed degree. The resulting incompatibility forms a barrier to the adoption of subdivision for CAD applications. Motivated by the search for NURBS-compatible subdivision schemes, we present a non-uniform subdivision algorithm for B-splines in the spirit of the uniform Lane-Ri...
متن کاملNon-uniform B-Spline Subdivision Using Refine and Smooth
Subdivision surfaces would be useful in a greater number of applications if an arbitrary-degree, non-uniform scheme existed that was a generalisation of NURBS. As a step towards building such a scheme, we investigate non-uniform analogues of the Lane-Riesenfeld ‘refine and smooth’ subdivision paradigm. We show that the assumptions made in constructing such an analogue are critical, and conclude...
متن کاملL-system specification of knot-insertion rules for non-uniform B-spline subdivision
Article history: Received 17 March 2011 Received in revised form 24 November 2011 Accepted 29 November 2011 Available online 7 December 2011
متن کاملA symmetric, non-uniform, refine and smooth subdivision algorithm for general degree B-splines
Subdivision surfaces would find a greater number of applications if there was a scheme that included general degree NURBS as a special case. As a step towards such a scheme, we present a univariate refine and smooth subdivision algorithm that applies directly to regular regions of a surface and might, in future work, be generalised to incorporate extraordinary points. The algorithm is symmetric...
متن کاملFast degree elevation and knot insertion for B-spline curves
We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using the control points, resampling the knot vector, and then computing the new control points from the derivatives. We compare our approach with previous algorithms and illustrate it with examples. 2004 Elsevier B.V. Al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 2009
ISSN: 0167-8396
DOI: 10.1016/j.cagd.2008.11.002